Co-clustering separately exchangeable network data
نویسندگان
چکیده
منابع مشابه
Co-clustering separately exchangeable network data
This article establishes the performance of stochastic blockmodels in addressing the co-clustering problem of partitioning a binary array into subsets, assuming only that the data are generated by a nonparametric process satisfying the condition of separate exchangeability. We provide oracle inequalities with rate of convergence OP (n ) corresponding to profile likelihood maximization and mean-...
متن کاملCo-Clustering Network-Constrained Trajectory Data
Recently, clustering moving object trajectories kept gaining interest from both the data mining and machine learning communities. This problem, however, was studied mainly and extensively in the setting where moving objects can move freely on the euclidean space. In this paper, we study the problem of clustering trajectories of vehicles whose movement is restricted by the underlying road networ...
متن کاملEdge exchangeable models for network data
Exchangeable models for vertex labeled graphs cannot replicate the large sample behaviors of sparsity and power law degree distributions observed in many network datasets. Out of this mathematical impossibility emerges the question of how network data can be modeled in a way that reflects known empirical behaviors and respects basic statistical principles. We address this question by observing ...
متن کاملEnergy Saving in Kiln Unit of of ABYEK CEMENT CO: Data Clustering Approach
Cost of cement producing all over the world depends on to the level of wages, energy cost and availability of raw materials. By investigating financial statements of various companies at the stock market, the share of electrical and fuel costs are nearly 27 percent of total costs and this plays the important role in right management of energy consumption. In this regard mathematics modeling and...
متن کاملClustering Large and Sparse Co-occurrence Data
A novel approach to clustering co-occurrence data poses it as an optimization problem in information theory — in this framework, an optimal clustering is one which minimizes the loss in mutual information. Recently a divisive clustering algorithm was proposed that monotonically reduces this loss function. In this paper we show that sparse high-dimensional data presents special challenges which ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 2014
ISSN: 0090-5364
DOI: 10.1214/13-aos1173